Finite fields - PDFSEARCH.IO - Document Search Engine

Finite fields
Results: 995

#	Item
361	PRIMES is in P Manindra Agrawal Neeraj Kayal ∗ Nitin Saxena Department of Computer Science & Engineering Add to Reading List Source URL: math.ucr.edu Language: English - Date: 2006-05-09 13:08:50 Primality tests Analytic number theory Finite fields Analysis of algorithms Computational complexity theory AKS primality test Prime number Randomized algorithm Time complexity Mathematics Abstract algebra Theoretical computer science
362	A new security proof for Damg˚ ard’s ElGamal Kristian Gjøsteen March 17, 2005 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-03-17 15:37:01 Finite fields Computational complexity theory Diffie–Hellman problem ElGamal encryption Universal hashing Paillier cryptosystem Diffie–Hellman key exchange Cramer–Shoup cryptosystem Index of cryptography articles Cryptography Cryptographic protocols Public-key cryptography
363	Security of ECQV-Certified ECDSA Against Passive Adversaries Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-03-09 14:11:31 Electronic commerce Cyberwarfare Mathematics Applied mathematics Implicit certificate Finite fields Elliptic Curve DSA Elliptic curve cryptography Digital signature Public-key cryptography Cryptography Key management
364	An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials Jan Camenisch1 , Markulf Kohlweiss2 , and Claudio Soriente3 1 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-22 05:56:52 Group signature Accumulator Proof of knowledge Diffie–Hellman problem XTR Diffie–Hellman key exchange Zero-knowledge proof Direct Anonymous Attestation Cryptography Cryptographic protocols Finite fields
365	Equivalent Keys in Multivariate Quadratic Public Key Systems Christopher Wolf1,2 , and Bart Preneel1 1 K.U.Leuven, ESAT-COSIC Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-12-22 06:53:55 Finite fields Hidden Field Equations Mathematics Affine geometry Affine transformation Unbalanced Oil and Vinegar Differential geometry Multivariate cryptography Frobenius group Post-quantum cryptography Geometry Abstract algebra
366	Comparing Implementation Efficiency of Ordinary and Squared Pairings Christine Abegail Antonio1 , Satoru 2 and Ken Nakamula3 Department of Mathematics, Tokyo Metropolitan University Minami-Osawa, Hachioji-shi Tokyo, Japa Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-07 19:51:10 Mathematics Cryptography Group theory Finite fields Weil pairing Elliptic curve Pairing Supersingular elliptic curve Tate pairing Abstract algebra Elliptic curves Algebra
367	On the Impossibility of Batch Update for Cryptographic Accumulators Philippe Camacho Dept. of Computer Science, University of Chile, Blanco Encalada 2120, 3er piso, Santiago, Chile. Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-15 20:16:12 Primality tests Mathematics Modular arithmetic Computing Finite fields Electronic engineering Public-key cryptography Paillier cryptosystem Accumulator
368	Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors? Noboru Kunihiro1 , Naoyuki Shinohara2 , and Tetsuya Izu3 1 The University of Tokyo, Japan Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-13 19:33:04 Public-key cryptography Error detection and correction Electronic commerce RSA XTR Bit error rate Entropy Key Cryptography Finite fields Information theory
369	Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field Ezekiel Justin Kachisa?1 , Edward F. Schaefer ??2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-14 05:53:33 Elliptic curves Finite fields Number theory Cryptography Group theory Weil pairing Supersingular elliptic curve Algebraic number field Curve Abstract algebra Mathematics Algebra
370	Faster index calculus for the medium prime case Application to 1175-bit and 1425-bit finite fields Antoine Joux CryptoExperts and Universit´e de Versailles Saint-Quentin-en-Yvelines, Laboratoire PRISM, ´ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-01-07 07:11:10 Orthogonal polynomials Polynomials Integer factorization algorithms Finite field General number field sieve Logarithm Special functions Mathematics Abstract algebra

UPDATE